Testabiiity of Convergent Tree Circuits - Computers, IEEE Transactions on
نویسنده
چکیده
The testing properties of a class of regular circuits called convergent trees are investigated. Convergent trees include such practical circuits as comparators, multiplexers, and carry-lookahead adders. The conditions for the testability of these tree circuits are derived for a functional fault model. The notion of L-testability is introduced, where the number of tests for a plevel tree is directly proportional to p , rather than exponential in p . Convergent trees that are C-testable (testable with a fixed number of tests, regardless of the tree's size) are also characterized. Two design techniques are also introduced that modify arbitrary tree modules in order to achieve Land C-testability. Finally, we apply these techniques to the design of a large carry-lookahead adder.
منابع مشابه
On Synthesis of Easily Testable (k, K) Circuits
A (k;K) circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k;K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in ...
متن کاملState of the Journal
Dimitris Gizopoulos is a professor in the Department of Informatics & Telecommunications, the National and Kapodistrian University of Athens where he leads the Computer Architecture Laboratory. His research focuses on the dependability, performance, and power efficiency of computing systems architectures built around high-performance and embedded multicore CPUs as well as GPUs. He has published...
متن کاملA Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits
Abstruct-A universal lower hound technique for the size and other implementation characteristics of an arbitrary Boolean function as a decision tree and as a two-level ANDDR circuit is derived. The technique is based on the power spectrum coefficients of the n-dimensional Fourier transform of the function. The bounds wry from constant to exponential and are tight in many cases. Several examples...
متن کامل